Line-segment intersection made in-placeVAHRENHOLD, Jan.Lecture notes in computer science. 2005, pp 146-157, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

Chain-based extraction of line segments to describe imagesCHALECHALE, Abdolah; NAGHDY, Golshah; PREMARATNE, Prashan et al.IEEE International Conference on multimedia. 2004, isbn 0-7803-8603-5, 3Vol, vol1, 355-358Conference Paper

On constrained minimum pseudotriangulationsROTE, Günter; CAO AN WANG; LUSHENG WANG et al.Lecture notes in computer science. 2003, pp 445-454, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

Connecting the maximum number of nodes in the grid to the boundary with nonintersecting line segmentsPALIOS, L.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 57-92, issn 0196-6774Article

Excess in arrangements of segmentsSHARIR, M.Information processing letters. 1996, Vol 58, Num 5, pp 245-247, issn 0020-0190Article

Applications harmoniques de B³ dans S² ayant une ligne de singularités = Axially symmetric harmonic maps from B³ into S² having a line of singularitiesRIVIERE, T.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1991, Vol 313, Num 9, pp 583-587, issn 0764-4442Article

Efficiency of the NPMLE in the line-segment problemVAN DER LAAN, M. J.Scandinavian journal of statistics. 1996, Vol 23, Num 4, pp 527-550, issn 0303-6898Article

On the directionality of interval ordersBOUCHITTE, V; JEGOU, R; RAMPON, J.-X et al.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 87-92, issn 0166-218XArticle

Fuzzy screen detector to improve performance of vision-based pointing deviceJANG, S; YOON, C; PARK, M et al.Electronics Letters. 2008, Vol 44, Num 21, pp 1247-1249, issn 0013-5194, 3 p.Article

Iterated snap rounding with bounded driftPACKER, Eli.SCG : symposium on computational geometry. 2006, pp 367-376, isbn 1-59593-340-9, 1Vol, 10 p.Conference Paper

An on-line sketch recognition algorithm for composite shapeZHAN DING; YIN ZHANG; WEI PENG et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28312-9, 2Vol, Part II, 120-129Conference Paper

Bounds for convex crossing numbersSHAHROKHI, Farhad; SYKORA, Ondrej; SZEKELY, Laszlo A et al.Lecture notes in computer science. 2003, pp 487-495, issn 0302-9743, isbn 3-540-40534-8, 9 p.Conference Paper

Billiard quorums on the grid 1AGRAWAL, D; EGECIOGLU, Ö; AMR EL ABBADI et al.Information processing letters. 1997, Vol 64, Num 1, pp 9-16, issn 0020-0190Article

ED line and polygon clipping based on space subdivisionSLATER, M; BARSKY, B. A.The Visual computer. 1994, Vol 10, Num 7, pp 407-422, issn 0178-2789Article

n+1 segments beat nTÖROCSIK, J.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 3, pp 491-500, issn 0895-4801Article

Orientation and anisotropy of multi-component shapes from boundary informationROSIN, Paul L; ZUNIC, Jovisa.Pattern recognition. 2011, Vol 44, Num 9, pp 2147-2160, issn 0031-3203, 14 p.Article

A PROBLEM OF GUARDING LINE SEGMENTRZYMOWSKI, Witold.SIAM journal on control and optimization. 2010, Vol 48, Num 2, pp 812-838, issn 0363-0129, 27 p.Article

The hausdorff dimension of visible sets of planar continuaO'NEIL, Toby C.Transactions of the American Mathematical Society. 2007, Vol 359, Num 11, pp 5141-5170, issn 0002-9947, 30 p.Article

Locked and unlocked chains of planar shapesCONNELLY, Robert; DEMAINE, Erik D; DEMAINE, Martin L et al.SCG : symposium on computational geometry. 2006, pp 61-70, isbn 1-59593-340-9, 1Vol, 10 p.Conference Paper

Encoding fullerenes and geodesic domesGRAVER, Jack E.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 4, pp 596-614, issn 0895-4801, 19 p.Article

A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segmentsCZYZOWICZ, J; KRANAKIS, E; URRUTIA, J et al.Information processing letters. 1998, Vol 66, Num 3, pp 125-126, issn 0020-0190Article

Computing many faces in arrangements of lines and segmentsAGARWAL, P. K; MATOUSEK, J; SCHWARZKOPF, O et al.SIAM journal on computing (Print). 1998, Vol 27, Num 2, pp 491-505, issn 0097-5397Article

Efficient computation of rectilinear geodesic voronoi neighbor in the presence of obstaclesMITRA, P; NANDY, S. C.Journal of algorithms (Print). 1998, Vol 28, Num 2, pp 315-338, issn 0196-6774Article

Reporting the crossing-free segments of a complete geometric graphFURUKATA, M; ASANO, K.International journal of computer mathematics. 1996, Vol 62, Num 3-4, pp 163-170, issn 0020-7160Article

A simple proof of Zorn's lemmaLEWIN, J.The American mathematical monthly. 1991, Vol 98, Num 4, pp 353-354, issn 0002-9890Article